61B - Hard Work - CodeForces Solution


strings *1300

Please click on ads to support us..

Python Code:

import collections
import heapq
import sys
import math
import itertools
import bisect
from io import BytesIO, IOBase
import os
def valid(i,j,n,m):
        if i<n and i>=0 and j>=0 and j< m :return True         return  False
def sumn(i,n):
    return (n-i)*(i+n)/2
def sqfun(a,b,c):
    return (-b+math.sqrt(b*b-4*a*c))/2*a



def value(): return tuple(map(int, input().split()))
def values(): return tuple(map(int, sys.stdin.readline().split()))
def inlst(): return [int(i) for i in input().split()]
def inlsts(): return [int(i) for i in sys.stdin.readline().split()]
def inp(): return int(input())
def inps(): return int(sys.stdin.readline())
def instr(): return input()
def stlst(): return [i for i in input().split()]


def f(s):
    r=''
    for i in s:
        if i not in ['-',';','_']:r+=i.lower()
    return r
def solve():
    l=[]
    for i in range(3):
        l.append(f(input()))
    t=itertools.permutations(l,len(l))
    l=[]
    for i in t:l.append("".join(i))
    for i in range(inp()):
        if f(instr()) in l:print ('ACC')
        else:print ('WA')


if __name__ == "__main__":
            solve()

C++ Code:

#include <iostream>
#include<vector>
#include <algorithm>
#include<string>
using namespace std;

char lowercase(char &c)
{
    if(c>='a'&&c<='z')
    {
        return c;
    }
    return c - ('A'-'a');
}

string clean(string &s)
{
    string ans = "";
    for(auto i:s)
    {
        if(i != '-' && i != ';'  && i != '_'  )
        {
            ans.push_back(lowercase(i));
        }
        
    }
    return ans;
}
void solve()
{
    string a,b,c;
    cin>>a>>b>>c;

    a = clean(a);
    b = clean(b);
    c = clean(c);
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        string in;
        cin>>in;
        in = clean(in);
        if(in != a+b+c && in != b+a+c && in != c+a+b && in != c+b+a && in != a+c+b && in != b+c+a)
        {
            cout<< "WA"<<endl;
        }
        else
        {
            cout<< "ACC" <<endl;
        }
    }

}

int main() {
    
    

    int t;
    t = 1;
    for(int i=0;i<t;i++)
    {
        solve();
    }
}


Comments

Submit
0 Comments
More Questions

2151. Maximum Good People Based on Statements
2144. Minimum Cost of Buying Candies With Discount
Non empty subsets
1630A - And Matching
1630B - Range and Partition
1630C - Paint the Middle
1630D - Flipping Range
1328A - Divisibility Problem
339A - Helpful Maths
4A - Watermelon
476A - Dreamoon and Stairs
1409A - Yet Another Two Integers Problem
977A - Wrong Subtraction
263A - Beautiful Matrix
180C - Letter
151A - Soft Drinking
1352A - Sum of Round Numbers
281A - Word Capitalization
1646A - Square Counting
266A - Stones on the Table
61A - Ultra-Fast Mathematician
148A - Insomnia cure
1650A - Deletions of Two Adjacent Letters
1512A - Spy Detected
282A - Bit++
69A - Young Physicist
1651A - Playoff
734A - Anton and Danik
1300B - Assigning to Classes
1647A - Madoka and Math Dad